Shape Retrieval With Geometrically Characterized Contour Partitions
نویسندگان
چکیده
منابع مشابه
Shape Retrieval with Flat Contour Segments
image database, image retrieval, run length coding, Freeman coding, downsampling Content-based image retrieval (CBIR) is an important issue in the computer vision community. Both visual and textual content descriptions are employed when the user formulates queries. Shape feature is an important visual feature, as it corresponds to the region of interest in images. For retrieval, shape compariso...
متن کاملContour-Based Shape Retrieval Using Dynamic Time Warping
A dissimilarity measure for shapes described by their contour, the Cyclic Dynamic Time Warping (CDTW) dissimilarity, is introduced. The dissimilarity measure is based on Dynamic Time Warping of cyclic strings, i.e., strings with no definite starting/ending points. The Cyclic Edit Distance algorithm by Maes cannot be directly extended to compute the CDTW dissimilarity, as we show in the paper. W...
متن کاملArithmagons and Geometrically Invariant Multiplicative Integer Partitions
In this article, we introduce a formal definition for integral arithmagons. Informally, an integral arithmagon is a polygonal figure with integer labeled vertices and edges in which, under a binary operation, adjacent vertices equal the included edge. By considering the group of automorphisms for the associated graph, we count the number of integral arithmagons whose exterior sum or product equ...
متن کاملTERZIĆ: SHAPE DETECTION WITH NEAREST NEIGHBOUR CONTOUR FRAGMENTS 1 Shape Detection with Nearest Neighbour Contour Fragments
We present a novel method for shape detection in natural scenes based on incomplete contour fragments and nearest neighbour search. In contrast to popular methods which employ sliding windows, chamfer matching and SVMs, we characterise each contour fragment by a local descriptor and perform a fast nearest-neighbour search to find similar fragments in the training set. Based on this idea, we sho...
متن کاملContour Grouping with Partial Shape Similarity
In this paper, a novel algorithm is introduced to group contours from clutter images by integrating high-level information (prior of part segments) and low-level information (edges of segmentations of clutter images). The partial shape similarity between these two levels of information is embedded into the particle filter framework, an effective recursively estimating model. The particles in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2015
ISSN: 2169-3536
DOI: 10.1109/access.2015.2451627